Adaptive polynomial least squares slope estimates of noisy data
نویسندگان
چکیده
Noise creates a harmful transformation on the estimation of derivative signal. In this paper, we suggest an easy to implement and adequate approximation method for function signal with noise. It is based polynomial regression constructed least squares differences, but degree depending signal-to-noise ratio. Numerical results similar accuracy compared established methods as Savitzsky-Golay smoothing wavelet transforms.
منابع مشابه
Least-squares polynomial approximation
We construct symmetric polar WAMs (Weakly Admissible Meshes) with low cardinality for least-squares polynomial approximation on the disk. These are then mapped to an arbitrary triangle. Numerical tests show that the growth of the least-squares projection uniform norm is much slower than the theoretical bound, and even slower than that of the Lebesgue constant of the best known interpolation poi...
متن کاملReversals of Least-Squares Estimates
An adjusted estimate may be opposite the original estimate. This paper presents necessary and sufficient conditions for such a reversal, in the context of linear modeling, where adjustment is obtained through considering additional explanatory data associated with lurking variables.
متن کاملUnifying Least Squares, Total Least Squares and Data Least Squares
The standard approaches to solving overdetermined linear systems Ax ≈ b construct minimal corrections to the vector b and/or the matrix A such that the corrected system is compatible. In ordinary least squares (LS) the correction is restricted to b, while in data least squares (DLS) it is restricted to A. In scaled total least squares (Scaled TLS) [15], corrections to both b and A are allowed, ...
متن کاملWeighted Least Squares and Adaptive Least Squares: Further Empirical Evidence
This paper compares ordinary least squares (OLS), weighted least squares (WLS), and adaptive least squares (ALS) by means of a Monte Carlo study and an application to two empirical data sets. Overall, ALS emerges as the winner: It achieves most or even all of the efficiency gains of WLS over OLS when WLS outperforms OLS, but it only has very limited downside risk compared to OLS when OLS outper...
متن کاملThe Sensitivity of Least Squares Polynomial Approximation
Given integers N n 0, we consider the least squares problem of nding the vector of coeecients ~ P with respect to a polynomial basis P N j=0 wn(zj) 2 jf(zj) ? P (zj)j 2. Here a perturbation of the values f(zj) leads to some perturbation of the coeecient vector ~ P. We denote by n the maximal magniication of relative errors, i.e., the Euclidean condition number of the underlying weighted Vanderm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistics and Management Systems
سال: 2021
ISSN: ['0972-0510', '2169-0014']
DOI: https://doi.org/10.1080/09720510.2021.1914427